منابع مشابه
Improved quick hypervolume algorithm
In this paper, we present an improved version of recently proposed Quick Hypervolume algorithm for calculating exact hypervolume of the space dominated by a set of d-dimensional points. This value is often used as a quality indicator in multiobjective evolutionary algorithms and other multiobjective metaheuristics and the efficiency of calculating this indicator is of crucial importance especia...
متن کاملHypervolume-Based Multi-Objective Path Relinking Algorithm
This paper presents a hypervolume-based multi-objective path relinking algorithm for approximating the Pareto optimal set of multi-objective combinatorial optimization problems. We focus on integrating path relinking techniques within a multi-objective local search as an initialization function. Then, we carry out a range of experiments on bi-objective flow shop problem and bi-objective quadrat...
متن کاملAn Efficient Algorithm for Computing Hypervolume Contributions
The hypervolume indicator serves as a sorting criterion in many recent multi-objective evolutionary algorithms (MOEAs). Typical algorithms remove the solution with the smallest loss with respect to the dominated hypervolume from the population. We present a new algorithm which determines for a population of size n with d objectives, a solution with minimal hypervolume contribution in time O(n(d...
متن کاملQuick fuzzy backpropagation algorithm
A modification of the fuzzy backpropagation (FBP) algorithm called QuickFBP algorithm is proposed, where the computation of the net function is significantly quicker. It is proved that the FBP algorithm is of exponential time complexity, while the QuickFBP algorithm is of polynomial time complexity. Convergence conditions of the QuickFBP, resp. the FBP algorithm are defined and proved for: (1) ...
متن کاملQuick Sort Algorithm
Given an array with n elements, we want to rearrange them in ascending order. In this paper, we introduce Quick Sort, a divide-and-conquer algorithm to sort an N element array. We evaluate the O(NlogN) time complexity in best case and O(N) in worst case theoretically. We also introduce a way to approach the best case.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2018
ISSN: 0305-0548
DOI: 10.1016/j.cor.2017.09.016